The submatrix constraint problem of matrix equation AXB+CYD=E

نویسندگان

  • Jiao-Fen Li
  • Xi-Yan Hu
  • Lei Zhang
چکیده

We say that X = [xij ]i,j=1 is symmetric centrosymmetric if xij = xji and xn−j+1,n−i+1, 1 ≤ i, j ≤ n. In this paper we present an efficient algorithm for minimizing ‖AXB + CY D − E‖ where ‖ · ‖ is the Frobenius norm, A ∈ Rt×n, B ∈ Rn×s, C ∈ Rt×m, D ∈ Rm×s, E ∈ Rt×s and X ∈ Rn×n is symmetric centrosymmetric with a specified central submatrix [xij ]r≤i,j≤n−r, Y ∈ Rm×m is symmetric with a specified central submatrix [yij ]1≤i,j≤p. Our algorithm produces suitable X and Y such that AXB + CY D = E in finitely many steps, if such X and Y exists. We show that the algorithm is stable any case, and we give results of numerical experiments that support this claim.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

On solutions to the quaternion matrix equation AXB+CYD=E

Expressions, as well as necessary and sufficient conditions are given for the existence of the real and pure imaginary solutions to the consistent quaternion matrix equation AXB+CY D = E. Formulas are established for the extreme ranks of real matrices Xi, Yi, i = 1, · · · , 4, in a solution pair X = X1 +X2i+X3j+X4k and Y = Y1+Y2i+Y3j+Y4k to this equation. Moreover, necessary and sufficient cond...

متن کامل

Diagonal and Monomial Solutions of the Matrix Equation AXB=C

In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 215  شماره 

صفحات  -

تاریخ انتشار 2009